منابع مشابه
Dynamic Programming on Nominal Graphs
Many optimization problems can be naturally represented as (hyper) graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjacent variables. Capitalizing on the structure of the graph, suitable dynamic programming strategies can select certain orders of evaluation of the variables which guarantee to reach both an optimal solution and a minima...
متن کاملClosed nominal rewriting and efficiently computable nominal
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete and efficient procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus an...
متن کاملNominal Algebra
Universal algebra [5, 9, 4] is the theory of equalities t = u. It is a simple framework within which we can study mathematical structures, for example groups, rings, and fields. It has also been applied to study the mathematical properties of mathematical truth and computability. For example boolean algebras correspond to classical truth, heyting algebras correspond to intuitionistic truth, cyl...
متن کاملNominal Narrowing
Nominal unification is a generalisation of first-order unification that takes α-equivalence into account. In this paper, we study nominal unification in the context of equational theories. We introduce nominal narrowing and design a general nominal E-unification procedure, which is sound and complete for a wide class of equational theories. We give examples of application. 1998 ACM Subject Clas...
متن کاملNominal SOS
Plotkin’s style of Structural Operational Semantics (SOS) has become a de facto standard in giving operational semantics to formalisms and process calculi. In many such formalisms and calculi, the concepts of names, variables and binders are essential ingredients. In this paper, we propose a formal framework for dealing with names in SOS. The framework is based on the Nominal Logic of Gabbay an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.48.4